Computing with quanta—impacts of quantum theory on computation

Quantum Computing in Complexity Theory and Theory of Computation

Traditionally, complexity theory has concerned itself with algorithms run by classical computers. With the recent developments in quantum computing, complexity theorists have begun considering just how quantum algorithms fit into the picture. After a brief introduction into classical complexity theory, we consider what is known and what is speculated about the relationship of the class of probl...

Quantum Computation, Theory Of

1-The study of the model of computation in which the state space consists of linear superpositions of classical configurations and the computational steps consist of applying local unitary operators and measurements as permitted by quantum mechanics. Quantum computation emerged in the 1980's when P. Benioff and R. Feynman realized that the apparent exponential complexity in simulating quantum p...

Quantum Computing Without Wavefunctions: Time-Dependent Density Functional Theory for Universal Quantum Computation

We prove that the theorems of TDDFT can be extended to a class of qubit Hamiltonians that are universal for quantum computation. The theorems of TDDFT applied to universal Hamiltonians imply that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. From a practical standpoint this opens the possibility of ap...

Quantum computation, quantum theory and AI

The main purpose of this paper is to examine some (potential) applications of quantum computation in AI and to review the interplay between quantum theory and AI. For the readers who are not familiar with quantum computation, a brief introduction to it is provided, and a famous but simple quantum algorithm is introduced so that they can appreciate the power of quantum computation. Also, a (quit...

Computing with Molecules: A New Type of Quantum Molecular Computation